Brief survey of garbage collection algorithms

نویسنده

  • David R. Chase
چکیده

In this paper (chapter) I describe several classes of garbage collection algorithms, and provide a few examples (both real and hypothetical) of each. This collection is by no means complete; Cohen [Coh81] presents an exhaustive collection, but I am more interested in describing a few representative collectors in detail and providing examples for a later paper (chapter) on garbage collection and optimization. The collectors are also chosen for comparison and contrast; the various algorithms are quite different, but often depend upon similar assumptions about program behavior for good performance. Empirical studies support many of these assumptions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniprocessor Garbage Collection Techniques

We survey basic garbage collection algorithms and variations such as incremental and gen erational collection The basic algorithms include reference counting mark sweep mark compact copy ing and treadmill collection Incremental techniques can keep garbage collection pause times short by interleaving small amounts of collection work with program execution Generational schemes improve e ciency an...

متن کامل

Uniprocessor Garbage Collection Techniques 1 Automatic Storage Reclamation

We survey basic garbage collection algorithms, and variations such as incremental and generational collection. The basic algorithms include reference counting, mark-sweep, mark-compact, copying, and treadmill collection. Incremental techniques can keep garbage collection pause times short, by interleaving small amounts of collection work with program execution. Generational schemes improve effi...

متن کامل

Empirical Studies of Distributed Garbage Collection

Garbage collection has been a necessary evil of computer languages that employ dynamic data structures. The 1990’s has seen some significant technology shifts that present new challenges for automatic garbage collection. In particular, distributed systems are providing an economical approach to parallel processing. Many distributed garbage collection algorithms have been proposed but few have b...

متن کامل

A Survey of Distributed Garbage Collection Techniques

We present the spectrum of distributed garbage collection techniques. We rst describe those reference counting-based techniques and compare them, in particular with respect to resilience to message failures. Reference counting-based techniques are acyclic since they are unable to collect cyclic data structures. We then describe a number of hybrid schemes improving over distributed reference cou...

متن کامل

Precompiling C++ for Garbage Collection

Our research is concerned with compiler-independent, eecient and convenient garbage collection for C++. Most collectors proposed for C++ have either been implemented in a library or in a compiler. As an intermediate step between those two, this paper proposes using precompilation techniques to augment a C++ source program with code to allow mostly type-accurate garbage collection. There are two...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987